PHILÂ 0012. Introduction to Symbolic Logic
Units: 3
Advisory: Eligibility for ENGL 1A
Hours: 54 lecture
Introduction to the principles of deductive reasoning including formal techniques of sentential and predicate logic. (C-ID PHIL 210) (CSU, UC)
PHIL 0012 - Introduction to Symbolic Logic
http://catalog.sierracollege.edu/course-outlines/phil-0012/
Catalog Description DESCRIPTION IS HERE: Advisory: Eligibility for ENGL 1A Hours: 54 lecture Description: Introduction to the principles of deductive reasoning including formal techniques of sentential and predicate logic. (C-ID PHIL 210) (CSU, UC) Units 3 Lecture-Discussion 54 Laboratory By Arrangement Contact Hours 54 Outside of Class Hours Course Student Learning Outcomes Use and apply terms: deductive, validity, soundness and consistency. Utilize deductive methods to test arguments for validity. Use the natural proof system to derive conclusions from premises. Course Content Outline I. Arguments A. Validity B. Soundness II. Symbolization and Syntax of Sentential Logic A. Truth-Functional vs Non-Truth-Functional Connectives B. Logical Connectors 1. Negations 2. Material Implications 3. Strict Implications 4. Disjunctions 5. Conjunctions 6. Biconditionals C. Syntax D. Translation Techniques III. Semantics of Sentential Logic A. Truth-Value Assignments and Truth Tables as a Proof Technique B. Truth, Falsity and Indeterminacy as appraisals for Statements C. Truth-Functional Equivalence, Consistency, Entailment and Validity as Appraisals for Arguments IV. A Derivation System for Sentential Logic A. Form and Application of Rules of Derivation B. Concepts and Strategies for Derivations C. Direct derivations, Conditional derivations and Indirect derivations V. Symbolization and Syntax of Predicate Logic A. Quantifiers and Multiple Quantification 1. Concepts of Quantification 2. Translation of Quantifiers 3. Translation of Multiple Quantifiers 4. Syntax VI. Semantics of Predicate Logic A. Quantificational Truth, Falsehood, and Indeterminacy B. Quantificational Equivalence, Consistency, Entailment and Validity VII. A Derivation System for Predicate Logic A. Rules for Derivation B. Strategies for Derivation Course Objectives Course Objectives 1. Define and demonstrate through truth tables, truth trees and deductive proofs the concept of and criteria for validity; 2. Define, explain and apply in written, oral and problem solving formats the concepts of a) truth preservation, b) truth-functionality, c) negation, d) material implication, e) strict implication, f) disjunction, g) conjunction, h) biconditionality, i) universal quantification, k) validity, l) theorem-hood, m) logical entailment, n) logical truth and o) logical derivation; 3. Translate, in English, sentences into symbolic sentence and predicate logic formats; 4. Translate, in written and oral activities, symbolic and predicate logic formatted arguments into ordinary English language; 5. Construct and chart truth trees or truth tables as a means of validity detection; 6. Describe, explain and apply in written, oral and problem solving activities rules of logical proof and derivation; 7. Evaluate ordinary English arguments utilizing deductive symbolic proof techniques and truth tables or truth trees; 8. Describe, explain and apply in problem solving activities rules of quantification in derivations; 9. Evaluate ordinary English arguments containing quantification; 10. Utilize the natural deduction method in sentential and predicate logic. Methods of Evaluation Classroom Discussions Objective Examinations Problem Solving Examinations Reading Assignments Read chapter on Sentential Logic: Semantics. Read the following philosophical argument, explicate the argument, symbolize the argument and construct a truth table to determine validity. 1. Computers can think if and only if they have emotions. If computers can have emotions, then they can have desires as well. But computers can't think if they have desires. Therefore computers can't think 2. If the butler murdered Devon, then the maid is lying, and if the gardener murdered Devon, then the weapon was a slingshot. The maid is lying if and only if the weapon wasn't a slingshot, and if the weapon wasn't a slingshot, then the butler murdered Devon. Therefore the butler murdered Devon. Writing, Problem Solving or Performance 1. Construct Truth Tables for the following three arguments to determine validity. ~P ~(Q <-> R) // ~[P * (Q -> R)] P->Q R->S PvR //QvS P -> Q ~P // ~Q 2. Directions: Symbolize and test the following argument for validity by using a truth table. If I'm going to do well on this daily quiz, then I will have a better test average. If I will have a better test average, then my grade in logic will be good. I'm not going to do well on this daily quiz. Therefore, my grade in logic will not be good. Let: W = I'm going to do well on this daily quiz B = I will have a better test average. G = My grade in logic will be good. Other (Term projects, research papers, portfolios, etc.) Methods of Instruction Lecture/Discussion Distance Learning Other materials and-or supplies required of students that contribute to the cost of the course.
Course Identification Numbering System (C-ID)
...120 PHIL 0002 PHIL 130 PHIL 0020 PHIL 140 PHIL 0021 PHIL 210 PHIL 0012...
Humanities
http://catalog.sierracollege.edu/departments/humanities/
...History PHIL 0013 Introduction to Asian Philosophy PHIL...AAD 0012 Visual Communication (also COMM 0012 ) ARHI...
